Symbolic dynamics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic dynamics

This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results on embeddings of shifts of finite type. The second one is the connection between syntactic semigroups and the classification of sofic shifts up to conjugacy.

متن کامل

Complex Dynamics and Symbolic Dynamics

Robert L. Devaney, Boston University Synopsis As so often happens in mathematics, there is a surprising connection between two quite distinct subfields of dynamical systems theory, namely the structure of the automorphism group of the one sided shift map on d-symbols and the topology of the analogue of the Mandelbrot set for degree d polynomials of one complex variable. In this lecture we will ...

متن کامل

Symbolic Lagrangian Multibody Dynamics

Symbolic Lagrangian formulations of the equations of motion of tree structured constrained mechanical systems have the potential to be both more efficient and more numerically robust than formulations which use nonlinear kinematic constraint equations. We derive a simple recursive factorization of the Lagrangian equations of motion which, along with our extended implementation of the D* symboli...

متن کامل

Symbolic dynamics and representations

The object of study of symbolic dynamics are discrete dynamical systems made of infinite sequences of symbols, with the shift acting on them. They come as codings of trajectories of points in a dynamical system according to a given partition. They are used as discretization tools for analyzing such trajectories, but they also occur in a natural way in arithmetics for instance. We first will rec...

متن کامل

Computable symbolic dynamics

We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Π1 class P is a subshift if and only if there is a computable function F mapping 2N to 2N such that P is the set of itineraries of elements of 2N. Π1 subshifts are constructed in 2N and in 2Z which have no computable elements. We also consider the symbolic dynamics of maps on th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scholarpedia

سال: 2008

ISSN: 1941-6016

DOI: 10.4249/scholarpedia.2923